an interior point algorithm for solving convex quadratic semidefinite optimization problems using a new kernel function

in this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual interior point method (ipm) based on a new kernel function with a trigonometric barrier term. iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. although our proposed kernel function is neither a self-regular (sr) function nor logarithmic barrier function, the primal-dual ipms based on this kernel function enjoy the worst case iteration bound $oleft(sqrt{n}log nlog frac{n}{epsilon}right)$ for the large-update methods with the special choice of its parameters. this bound coincides to the so far best known complexity results obtained from sr kernel functions for linear and semidefinite optimization problems. finally some numerical issues regarding the practical performance of the new proposed kernel function is reported.